Yet Another Proof of the Aperiodicity of Robinson Tiles

نویسنده

  • Thomas Fernique
چکیده

An aperiodic tile set is a finite set of tiles which can tile the plane (i.e. cover it without overlap), but not in a periodic way (i.e., no tiling is invariant by a translation). To prove the undecidability of the the Domino problem, Robert Berger constructed in 1966 the first aperiodic tile set [1]. His proof was simplified in 1971 by Rafael Robinson, who introduced a six-tile set and proved its aperiodicity. Fig. 1 depicts these celebrated six tiles and introduces some terminology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yet Another Aperiodic Tile Set

We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic tile sets we believe this construction introduces an approach that is different enough to be interesting and that the whole construction and the proof of aperiodicity are hopefully simpler than most existing techniques. Aperiodic tile sets have been widely studied si...

متن کامل

معرفی و مطالعه‌ تطبیقی کاشی‌های کوباچه‌ حمام وزیر در شهر اصفهان

There are 25 underglaze painted tiles in Vazir Bathhouse of isfahan that have not been studied and identified yet. These tiles are among the few remaining Kubachi tile samples in their original installation location, which remain untouched from looting. Identifying and introducing the Vazir Bathhouse's tiles are very important to recognize the Kubachi potteries, since the proof of the Kubachi n...

متن کامل

A hierarchical strongly aperiodic set of tiles in the hyperbolic plane

We give a new construction of strongly aperiodic set of tiles in H, exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that the Domino problem is undecidable in the hyperbolic plane [13]. Ludwig Danzer once asked whether, in the hyperbolic plane, where there are no similarities, there could be any notion of hierarchical tiling—an idea which pla...

متن کامل

Gobal Order Or

usually is a Fibonacci number)? Is it possible to program locally connected computers in such a way that the network is still functional if a small fraction of the nodes is corrupted? Is it possible for a big team of people (or ants), each trying to reach private goals, to behave reasonably? These questions range from theology to "political science" and are rather difficult. In mathematics the ...

متن کامل

Another proof of Banaschewski's surjection theorem

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1711.03401  شماره 

صفحات  -

تاریخ انتشار 2017